Realizing degree imbalances in directed graphs
نویسندگان
چکیده
منابع مشابه
Realizing degree imbalances in directed graphs
In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence can be produced by a greedy algorithm. A sequence of integers is graphic if there is a simple undirected graph for which it is the degree sequence. There ar...
متن کاملAlgorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملRealizing degree sequences as Z3-connected graphs
An integer-valued sequence π = (d1, . . . , dn) is graphic if there is a simple graph G with degree sequence of π . We say the π has a realization G. Let Z3 be a cyclic group of order three. A graph G is Z3-connected if for every mapping b : V (G) → Z3 such that v∈V (G) b(v) = 0, there is an orientation of G and amapping f : E(G) → Z3−{0} such that for each vertex v ∈ V (G), the sum of the va...
متن کاملNP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match the given sequence. This realization problem is known to be polynomial-time solvable when the graph is directed or undirected. In contrast, we show NP-completeness for the problem of realizing a given sequence of pairs of nonnegative integers (representing i...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00048-6